Speeding up Evolutionary Search by Small Fitness Fluctuations
نویسندگان
چکیده
منابع مشابه
Speeding up Evolutionary Search by Small Fitness Fluctuations.
We consider a fixed size population that undergoes an evolutionary adaptation in the weak mutation rate limit, which we model as a biased Langevin process in the genotype space. We show analytically and numerically that, if the fitness landscape has a small highly epistatic (rough) and time-varying component, then the population genotype exhibits a high effective diffusion in the genotype space...
متن کاملSpeeding up keyword search for search engines
In the current information age, the dominant method for information search is by providing few keywords to a search engine. Keyword search is currently one of the most important operations in search engines and numerous other applications. In this paper we propose a new text indexing technique for improving the performance of keyword search. Our proposed technique not only speeds up searching o...
متن کاملSpeeding up Evolutionary Algorithms by Restricted Mutation Operators
We investigate the effect of restricting the mutation operator in evolutionary algorithms with respect to the runtime behavior. Considering the Eulerian cycle problem we present runtime bounds on evolutionary algorithms with a restricted operator that are much smaller than the best upper bounds for the general case. In our analysis it turns out that a plateau which has to be coped with for both...
متن کاملSpeeding Up Backpropagation Using Multiobjective Evolutionary Algorithms
The use of backpropagation for training artificial neural networks (ANNs) is usually associated with a long training process. The user needs to experiment with a number of network architectures; with larger networks, more computational cost in terms of training time is required. The objective of this letter is to present an optimization algorithm, comprising a multiobjective evolutionary algori...
متن کاملSpeeding Up Evolutionary Learning Algorithms using GPUs
This paper propose a multithreaded Genetic Programming classification evaluation model using NVIDIA CUDA GPUs to reduce the computational time due to the poor performance in large problems. Two different classification algorithms are benchmarked using UCI Machine Learning data sets. Experimental results compare the performance using single and multithreaded Java, C and GPU code and show the eff...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Statistical Physics
سال: 2011
ISSN: 0022-4715,1572-9613
DOI: 10.1007/s10955-011-0199-6